package edu.whu.rose.clock.kps.algorithm.sortedlists;


public class ConnectedTree {

	private int subgraph;
	private int root;
	private int position;
	private int[] matched_vertexes;
//	private int[] vPositions;
	private int score;

	public ConnectedTree(int subgraph, int root, int position, int[] matched_vertexes, int score) {
		this.subgraph = subgraph;
		this.root = root;
		this.position = position;
		this.matched_vertexes = matched_vertexes;
//		this.vPositions = vPositions;
		this.score = score;
	}

	public int getSubgraph() {
		return subgraph;
	}

	public int getRoot() {
		return root;
	}
	
	public int getPosition() {
		return position;
	}

	public int[] getMatched_vertexes() {
		return matched_vertexes;
	}
	
//	public int[] getVPositions() {
//		return vPositions;
//	}

	public int getScore() {
		return score;
	}

}
